Algebraic theory of finite fourier transforms
نویسندگان
چکیده
منابع مشابه
Fourier Transforms of Finite Chirps
Chirps arise in many signal processing applications. While chirps have been extensively studied both as functions over the real line and the integers, less attention has been paid to the study of chirps over finite groups. We study the existence and properties of chirps over finite cyclic groups of integers. In particular, we introduce a new definition of a finite chirp which is slightly more g...
متن کاملFast Fourier Transforms for Finite Inverse Semigroups
We extend the theory of fast Fourier transforms on finite groups to finite inverse semigroups. We use a general method for constructing the irreducible representations of a finite inverse semigroup to reduce the problem of computing its Fourier transform to the problems of computing Fourier transforms on its maximal subgroups and a fast zeta transform on its poset structure. We then exhibit exp...
متن کاملOn the Parametrization of Algebraic Discrete Fourier Transforms
Computing the Discrete Fourier Transform (DFT) of signals over some nite eld Fq often requires an extension to a large eld Fqn containing an appropriate primitive root of unity. The Algebraic Discrete Fourier Transforms (ADFTs) avoid the extension of the base eld Fq and can be used to compute the spectrum of the DFT. We derive a complete parametrization of ADFT matrices and show how this knowle...
متن کاملComputational Complexity of Fourier Transforms Over Finite Fields*
In this paper we describe a method for computing the Discrete Fourier Transform (DFT) of a sequence of n elements over a finite field GF(pm) with a number of bit operations 0(nm log(nm) ■ P(q)) where P(q) is the number of bit operations required to multiply two q-bit integers and q = 2 log2« + 4 log2m + 4 log2p. This method is uniformly applicable to all instances and its order of complexity is...
متن کاملSpread-Spectrum Based on Finite Field Fourier Transforms
Spread-spectrum systems are presented, which are based on Finite Field Fourier Transforms. Orthogonal spreading sequences defined over a finite field are derived. New digital multiplex schemes based on such spread-spectrum systems are also introduced, which are multilevel Coding Division Multiplex. These schemes termed Galois-field Division Multiplex (GDM) offer compact bandwidth requirements b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1971
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(71)80014-4